6.1 Fast Approximation Schemes for Packing and Cov- Ering Lp's 6.1.1 Packing and Covering Lp's
نویسنده
چکیده
In this lecture we show how to remove the dependence on the width in the multiplicative weights update/randomized fictitious play method, in the case when the entries of the matrix are non-negative. Our presentation follows mostly the framework of Koufogiannakis and Young [KY07]. In the next lecture will show how to derive the result of Garg and Könemann [GK98] for multicommodity flows from this framework.
منابع مشابه
Primal-Dual Approximation Algorithms for Metric Facility Location and k-Median Problems
We present approximation algorithms for the metric uncapacitated facility location problem and the metric k-median problem achieving guarantees of 3 and 6 respectively. The distinguishing feature of our algorithms is their low running time: O(m log m) and O(m logm(L+log(n))) respectively, where n and m are the total number of vertices and edges in the underlying graph. The main algorithmic idea...
متن کاملIbm Research Report Courteous Logic Programs: Prioritized Connict Handling for Rules
We de ne courteous logic programs, an expressive superclass of general logic programs, for the acyclic case. Courteous LP's feature not only classical negation as in extended LP's (Gelfond & Lifschitz), but also prioritized conict handling. We show courteous LP's always have a consistent and unique answer set, which can be computed in O(m2) time, where m is the size of the ground-instantiated p...
متن کاملHardness of approximation for orthogonal rectangle packing and covering problems
Bansal and Sviridenko [4] proved that there is no asymptotic PTAS for 2-dimensional Orthogonal Bin Packing (without rotations), unless P = NP. We show that similar approximation hardness results hold for several 2and 3-dimensional rectangle packing and covering problems even if rotations by ninety degrees are allowed. Moreover, for some of these problems we provide explicit lower bounds on asym...
متن کاملA Fast Approximation Scheme for Fractional Covering Problems with Box Constraints∗
We present the first combinatorial approximation scheme that yields a pure approximation guarantee for linear programs that are either covering problems with upper bounds on variables, or their duals. Existing approximation schemes for mixed covering and packing problems do not simultaneously satisfy packing and covering constraints exactly. We present the first combinatorial approximation sche...
متن کاملApproximation Schemes for Covering and Packing in the Streaming Model
The shifting strategy, introduced by Hochbaum and Maass [10], and independently by Baker [1], is a unified framework for devising polynomial approximation schemes to NP-Hard problems. This strategy has been used to great success within the computational geometry community in a plethora of different applications; most notably covering, packing, and clustering problems [2, 5, 7, 8, 9]. In this pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010